Self-Avoiding Random Dynamics on Integer Complex Systems
نویسندگان
چکیده
منابع مشابه
Self Avoiding Random Surfaces
Self avoiding random surfaces on a cubic lattice are studied by extensive Monte Carlo sampling The surfaces have empty boundary and the topology of a sphere An oct tree data structure allows to obtain good statistics for surfaces whose plaquette number is almost an order of magnitude greater than in previous investigations Maximum likelihood determinations of the critical plaquette fugacity and...
متن کاملSelf-avoiding random walks on lattice strips.
A self-avoiding walk on an infinitely long lattice strip of finite width will asymptotically exhibit an end-to-end separation proportional to the number of steps. A proof of this proposition is presented together with comments concerning an earlier attempt to deal with the matter. In addition, some unproved, yet "obvious," conjectures concerning self-avoiding walks are cited as basic propositio...
متن کاملEnumerating Up-Side Self-Avoiding Walks on Integer Lattices
A self-avoiding walk (saw) is a path on a lattice that does not pass through the same point twice. Though mathematicians have studied saws for over fifty years, the number of n-step saws is unknown. This paper examines a special case of this problem, finding the number of nstep “up-side” saws (ussaws), saws restricted to moving up and sideways. It presents formulas for the number of n-step ussa...
متن کاملSelf-avoiding Random Walks and Olbers’ Paradox
In this paper, we prove that a self-avoiding walk of infinite length provides a structure that would resolve Olbers’ paradox. That is, if the stars of a universe were distributed like the vertices of an infinite random walk with each segment length of about a parsec, then the night sky could be as dark as actually observed on the Earth. Self-avoiding random walk structure can therefore resolve ...
متن کاملEnumeration study of self - avoiding random surfaces
We employ exact enumeration methods to study a number of configurational properties of self-avoiding random surfaces embedded in a three-dimensional simple cubic lattice. Self-avoiding surfaces are defined as a connected set of plaquettes in which no more than two plaquettes may meet along a common edge, and in which no plaquette can be occupied more than once. Based on enumeratingsurfaces cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Modeling and Computer Simulation
سال: 2013
ISSN: 1049-3301,1558-1195
DOI: 10.1145/2414416.2414790